Optimal embeddings of multiple graphs into a hypermesh
نویسندگان
چکیده
A hypermesh, a versatile parallel architecture, is obtained from a 2-dimensional mesh by replacing each linear connection with a hyper-edge. We optimally embed multiple graphs into a hypermesh by a labeling strategy. This optimal embedding provides an optimal expansion, dilation and congestion at the same time. First, we label on an N-node graph G, possibly disconnected, such that this labeling makes it possible to optimally embed multiple copies of G into an N0 N0 hypermesh when N0 is divisible by N. Second, we show that many important classes of graphs have this labeling: for example, tree, cycle, mesh of trees and product graphs including mesh, torus, and hypercube. Third, we generalize these results to optimally embed multiple graphs into a multidimensional and possibly non-square hypermesh. This labeling strategy is applicable to the embeddings of other classes of graphs into a hypermesh.
منابع مشابه
Embeddings of Butterflies into Hypermeshes
Hypermeshes have been given much attention as a versatile interconnection network of parallel computers. A hypermesh is obtained from a mesh by replacing each linear connection with a hyperedge. In this paper, we show how to embed a butterry or multiple copies of a butterry into a hypermesh. First, a butterry B(s) of (s+1)2 s nodes is embedded into a 2 s X hypermesh where X = 2 blog 2 sc+1. Sec...
متن کاملThe Complexity of FFT and Related Butterfly Algorithms on Meshes and Hypermeshes
Parallel FFT data-flow graphs based on a Butterfly graph followed by a bit-reversal permutation are known, as are optimal-order embeddings of these flow-graphs onto meshes and hypercubes. Embeddings onto a 2D mesh require O(sqrtN) data transfer steps and O(logN) computation steps. Embeddings onto a hypercube require O(logN) data transfer steps and O(logN) computation steps. A similar FFT algori...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملOptimal Embeddings of Multiple Graphs into a Mesh of Buses
A mesh of buses (MOB), a versatile parallel architecture, is obtained from a 2-dimensional mesh by replacing each linear connection with a bus. We optimally embed multiple graphs into a MOB by a labeling strategy. This optimal embedding provides an optimal expansion, dilation and congestion at the same time. First, we label on an N-node graph G, possibly disconnected, such that this labeling ma...
متن کاملEmbedding Complete Binary Trees into Star Networks
Abs t rac t . Star networks have been proposed as a possible interconnection network for massively parallel computers. In this paper we investigate embeddings of complete binary trees into star networks. Let G and H be two networks represented by simple undirected graphs. An embedding of G into H is an injective mapping f from the vertices of G into the vertices of H. The dilation of the embedd...
متن کامل